Spectral moments of trees with given degree sequence
نویسندگان
چکیده
Article history: Received 16 April 2013 Accepted 11 October 2013 Available online 30 October 2013 Submitted by R. Brualdi MSC: 05C05 05C50 05C35
منابع مشابه
Lexicographical ordering by spectral moments of trees with a given bipartition
Lexicographic ordering by spectral moments ($S$-order) among all trees is discussed in this paper. For two given positive integers $p$ and $q$ with $pleqslant q$, we denote $mathscr{T}_n^{p, q}={T: T$ is a tree of order $n$ with a $(p, q)$-bipartition}. Furthermore, the last four trees, in the $S$-order, among $mathscr{T}_n^{p, q},(4leqslant pleqslant q)$ are characterized.
متن کاملSIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کاملLimit distribution of the degrees in scaled attachment random recursive trees
We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...
متن کاملEla the P -laplacian Spectral Radius of Weighted Trees with a Degree Sequence and a Weight Set∗
In this paper, some properties of the discrete p-Laplacian spectral radius of weighted trees have been investigated. These results are used to characterize all extremal weighted trees with the largest p-Laplacian spectral radius among all weighted trees with a given degree sequence and a positive weight set. Moreover, a majorization theorem with two tree degree sequences is presented.
متن کاملThe p-Laplacian spectral radius of weighted trees with a degree sequence and a weight set
In this paper, some properties of the discrete p-Laplacian spectral radius of weighted trees have been investigated. These results are used to characterize all extremal weighted trees with the largest p-Laplacian spectral radius among all weighted trees with a given degree sequence and a positive weight set. Moreover, a majorization theorem with two tree degree sequences is presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013